Symbolic defects of edge ideals of unicyclic graphs
نویسندگان
چکیده
We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let [Formula: see text] be unicyclic graph with unique odd cycle and its ideal. compute exact values all symbolic defects using describe one method to find quasi-polynomial associated ideal text]. classify class graphs when some power maximal annihilates any fixed Also those graphs, we Hilbert function module
منابع مشابه
Edge Szeged Index of Unicyclic Graphs
The edge Szeged index of a connected graph G is defined as the sum of products mu(e|G)mv(e|G) over all edges e = uv of G, where mu(e|G) is the number of edges whose distance to vertex u is smaller than the distance to vertex v, and mv(e|G) is the number of edges whose distance to vertex v is smaller than the distance to vertex u. In this paper, we determine the n-vertex unicyclic graphs with th...
متن کاملBinomial Edge Ideals of Graphs
We characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, we show that complete graphs are the only graphs with this property. We also compute some graded components of the first Betti number of the binomial edge ideal of a graph with respect to the graphical terms. Finally, we give an upper bound for the Castelnuovo-Mumford regularity of the binomial edge ideal of...
متن کاملCharacterization of total restrained domination edge critical unicyclic graphs
A graph with no isolated vertices is edge critical with respect to total restrained domination if for any non-edge e of G, the total restrained domination number of G+ e is less than the total restrained domination number of G. We call these graphs γtr-edge critical. In this paper, we characterize all γtr-edge critical unicyclic graphs.
متن کاملCombinatorics of Symbolic Rees Algebras of Edge Ideals of Clutters
Let C be a clutter and let I be its edge ideal. We present a combinatorial description of the minimal generators of the symbolic Rees algebra Rs(I) of I . It is shown that the minimal generators of Rs(I) are in one to one correspondence with the irreducible parallelizations of C. From our description some major results on symbolic Rees algebras of perfect graphs and clutters will follow. As a b...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2022
ISSN: ['1793-6829', '0219-4988']
DOI: https://doi.org/10.1142/s0219498823500998